A note on extensions of infinitary logic
نویسندگان
چکیده
We show that a strong form of the so called Lindström’s Theorem [4] fails to generalize to extensions of Lκω and Lκκ: For weakly compact κ there is no strongest extension of Lκω with the (κ, κ)compactness property and the Löwenheim-Skolem theorem down to κ. With an additional set-theoretic assumption, there is no strongest extension of Lκκ with the (κ, κ)-compactness property and the LöwenheimSkolem theorem down to < κ. By a well-known theorem of Lindström [4], first order logic Lωω is the strongest logic which satisifies the compactness theorem and the downward Löwenheim-Skolem theorem. For weakly compact κ, the infinitary logic Lκω satisfies both the (κ, κ)-compactness property and the Löwenheim-Skolem theorem down to κ. In [1] Jon Barwise pointed out that Lκω is not maximal with respect to these properties, and asked what is the strongest logic based on a weakly compact cardinal κ which still satisfies the (κ, κ)-compactness property and some other natural conditions suggested by κ. We prove (Corollary 5) that for weakly compact κ there is no strongest extension of Lκω with We are indebted to Lauri Hella, Tapani Hyttinen and Kerkko Luosto for useful suggestions. Research partially supported by the United States-Israel Binational Science Foundation. Publication number [ShVa:726] Research partially supported by grant 40734 of the Academy of Finland.
منابع مشابه
Finite Proofs for Infinitary Formulas
Recent work has shown that the infinitary logic of hereand-there is closely related to the input language of the ASP grounder gringo. A formal system axiomatizing that logic exists, but a proof in that system may include infinitely many formulas. In this note, we define a correspondence between the validity of infinitary formulas in the logic of here-and-there and the provability of formulas in...
متن کاملEmbedding-based Approaches to Temporal Logics: a Survey
Embedding LTL into IL. Linear-time temporal logic (LTL) is known to be one of the most useful logics in Computer Science, and infinitary logic (IL) is known to be an important logic in Mathematical Logic. The research fields of both LTL and IL have independently developed each other, and the relationship between them has not yet been discussed. In [1], the relationship between LTL and IL was cl...
متن کاملStable models for infinitary formulas with extensional atoms
The definition of stable models for propositional formulas with infinite conjunctions and disjunctions can be used to describe the semantics of answer set programming languages. In this note, we enhance that definition by introducing a distinction between intensional and extensional atoms. The symmetric splitting theorem for first-order formulas is then extended to infinitary formulas and used ...
متن کاملOn the compactness property of extensions of first-order G"{o}del logic
We study three kinds of compactness in some variants of G"{o}del logic: compactness,entailment compactness, and approximate entailment compactness.For countable first-order underlying language we use the Henkinconstruction to prove the compactness property of extensions offirst-order g logic enriched by nullary connective or the Baaz'sprojection connective. In the case of uncountable first-orde...
متن کاملEquality propositional logic and its extensions
We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Arch. Math. Log.
دوره 44 شماره
صفحات -
تاریخ انتشار 2005